Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
نویسندگان
چکیده
Message sequence charts (MSC) are a graphical speciica-tion language widely used for designing communication protocols. Our starting point are two decision problems concerning the correctness and the consistency of a design based by MSC graphs. Both problems are shown to be undecidable, in general. Using a natural connectivity assumption from Mazurkiewicz trace theory we show both problems to be EXPSPACE-complete for locally synchronized graphs. The results are based on new complexity results for star-connected rational trace languages .
منابع مشابه
Deciding Properties for Message Sequence Charts
Message sequence charts (MSC) are commonly used in designing communication systems. They allow describing the communication skeleton of a system and can be used for nding design errors. First, a speciication formalism that is based on MSC graphs, combining nite message sequence charts, is presented. We present then an automatic validation algorithm for systems described using the message sequen...
متن کاملDagstuhl Seminar on Logic, Algebra, and Formal Verification of Concurrent Systems
s of the Talks 6 Pascal Weil Recognizability and regularity for languages of series-parallel pomsets . . . . . . . . . . . . . 6 Lenore Zuck Automatic Deductive Verification with Invisible Invariants . . 7 Manfred Droste Process Cost Functions for Concurrent Systems . . . . . . . . 7 Doron Peled Black Box Checking . . . . . . . . . . . . . . . . . . . . . . . . 8 Rémi Morin On Rational Message ...
متن کاملWeighted Distributed Systems and Their Logics
We provide a model of weighted distributed systems and give a logical characterization thereof. Distributed systems are represented as weighted asynchronous cellular automata. Running over directed acyclic graphs, Mazurkiewicz traces, or (lossy) message sequence charts, they allow for modeling several communication paradigms in a unifying framework, among them probabilistic sharedvariable and p...
متن کاملOn First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic and first-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical properties can be described by rather simple logical formulas one is interested in logical fragments. One focus of this paper is unary temporal logic and first-order logic in two variables. Over words, this correspo...
متن کاملDeciding LTL over Mazurkiewicz Traces
Linear time temporal logic (LTL) has become a well established tool for specifying the dynamic behaviour of reactive systems with an interleaving semantics, and the automata-theoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999